Public key system by using isomorphism group

نویسندگان

چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Loopholes in Two Public Key Cryptosystems Using the Modular Group

We demonstrate that the public key cryptosystems using the modular group suggested in [4,5] are vulnerable to very simple ciphertextonly attacks. Consequently, in the present form both of these systems cannot be considered as sufficiently secure for cryptographic purposes.

متن کامل

Group Authentication Using The Naccache-Stern Public-Key Cryptosystem

A group authentication protocol authenticates pre-defined groups of individuals such that: • No individual is identified • No knowledge of which groups can be successfully authenticated is known to the verifier • No sensitive data is exposed The paper presents a group authentication protocol based on splitting the private keys of the Naccache-Stern public-key cryptosystem in such a way that the...

متن کامل

Public Key Exchange Using Matrices Over Group Rings

We offer a public key exchange protocol in the spirit of Diffie-Hellman, but weuse (small) matrices over a group ring of a (small) symmetric group as the platform. This“nested structure” of the platform makes computation very efficient for legitimate parties.We discuss security of this scheme by addressing the Decision Diffie-Hellman (DDH) andComputational Diffie-Hellman (CDH) p...

متن کامل

Thompson's Group and Public Key Cryptography

Recently, several public key exchange protocols based on symbolic computation in non-commutative (semi)groups were proposed as a more efficient alternative to well established protocols based on numeric computation. Notably, the protocols due to Anshel-Anshel-Goldfeld and Ko-Lee et al. exploited the conjugacy search problem in groups, which is a ramification of the discrete logarithm problem. H...

متن کامل

The XTR Public Key System

This paper introduces the XTR public key system. XTR is based on a new method to represent elements of a subgroup of a multiplicative group of a finite field. Application of XTR in cryptographic protocols leads to substantial savings both in communication and computational overhead without compromising security.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Baghdad Science Journal

سال: 2009

ISSN: 2411-7986,2078-8665

DOI: 10.21123/bsj.6.2.320-322